Analysis of a Non{overlapping Domain Decomposition Method for Elliptic Partial Diierential Equations 1

نویسنده

  • Daoqi Yang
چکیده

In this study we analyze a non-overlapping domain decomposition method for the solution of elliptic Partial Diierential Equation (PDE) problems. This domain decomposition method involves the solution of Dirichlet and Neumann PDE problems on each subdomain, coupled with smoothing operations on the interfaces of the subdomains. The convergence analysis of the method at the diierential equation level is presented. The numerical results connrm the theoretical ones and exhibit the computational eeciency of the method.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interface Relaxation Methods for Elliptic Diierential Equations 1

A population of eight non-overlapping domain decomposition methods for solving Elliptic Diierential Equations viewed and formulated as iterated interface relaxation procedures is considered. A comprehensive review of the underlying mathematical ideas and the computational characteristics is given. The existing theoretical results are also reviewed and high level descriptions of the various algo...

متن کامل

First-order System Least- Squares for Second-order Partial Diierential Equations: Part Ii. Siam J

analysis of iterative substructuring algorithms for elliptic problems in three dimensions. Least-squares mixed-nite elements for second-order elliptic problems. A least-squares approach based on a discrete minus one inner product for rst order systems. Technical report, Brookhaven National Laboratory, 1994. 4] J. H. Bramble and J. E. Pasciak. Least-squares methods for Stokes equations based on ...

متن کامل

Domain Decomposition Methods for Inverse Problems

Inverse problems related to the estimation of coeecients of partial diierential equations are illposed. Practical applications often use the t-to-data output-least-square's method to recover the coeecients. In this work, we develop parallel nonoverlapping domain decomposition algorithms to estimate the diiusion coeecient associated with elliptic diierential equations. In order to realize the do...

متن کامل

Numerical Experiments With an Overlapping Additive Schwarz Solver for 3-d pArallel Reservoir Simulation

Domain decomposition methods are a major area of contemporary research in numerical analysis of partial diierential equations. They provide robust, parallel and scalable preconditioned iterative methods for the large linear systems arising when continuous problems are discretized by nite elements, nite diierences or spectral methods. This paper presents some numerical experiments on a distribut...

متن کامل

A Parallel Implementation of an Iterative Substructuring Algorithm for Problems in Three Dimensions

Numerical results from a parallel implementation of an iterative substructuring algorithm are reported. The algorithm is for solving scalar, self-adjoint elliptic partial diierential equations in three dimensions. Results are given for two variants of the algorithm. In the rst variant, exact interior solvers are used; in the second, one multigrid V-cycle is used to approximately solve the inter...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998